|
|
The Design of Minimal Bluetooth Stack
Gazda, Martin ; Zbořil, František (referee) ; Hanáček, Petr (advisor)
This master's thesis main aim is to design minimal Bluetooth stack for embedded applications running on an education platform FITkit. This paper contains a theoretical foundation for that work and implementation description. The main section includes Bluetooth protocol stack design and main opportunities which such a design raises.
|
|
|
Rendering "Small" Plants in 3D Space
Řehánek, Jiří ; Přibyl, Jaroslav (referee) ; Herout, Adam (advisor)
This masters thesis deals with a real-time low vegetation rendering in 3D space. The low vegetation means grass and shrub. At first it looks on a implementation of vegetation in a 3D games that already exist and there investigate characteristics notable while playing and after that it comes to a evaluation of visual qualities. As next will follow design of solution of this problems and description of implementation. In final part will be summary of achieved product.
|
|
|
Optimization of network flow monitoring
Žádník, Martin ; Lhotka,, Ladislav (referee) ; Matoušek, Radomil (referee) ; Sekanina, Lukáš (advisor)
The thesis deals with optimization of network flow monitoring. Flow-based network traffic processing, that is, processing packets based on some state information associated to the flows which the packets belong to, is a key enabler for a variety of network services and applications. The number of simultaneous flows increases with the growing number of new services and applications. It has become a challenge to keep a state per each flow in a network device processing high speed traffic. A flow table, a structure with flow states, must be stored in a memory hierarchy. The memory closest to the processing is known as a flow cache. Flow cache management plays an important role in terms of its effective utilization, which affects the performance of the whole system. This thesis focuses on an automated design of cache replacement policy optimized to a deployment on particular networks. A genetic algorithm is proposed to automate this process. The genetic algorithm generates and evaluates evolved replacement policies by a simulation on obtained traffic traces. The proposed algorithm is evaluated by designing replacement policies for two variations of the cache management problem. The first variation is an evolution of the replacement policy with an overall low number of state evictions from the flow cache. The second variation represents an evolution of the replacement policy with a low number of evictions belonging to large flows only. Optimized replacement policies for both variations are found while experimenting with various encoding of the replacement policy and genetic operators. The newly evolved replacement policies achieve better results than other tested policies. The evolved replacement policy lowers the overall amount of evictions by ten percent in comparison with the best compared policy. The evolved replacement policy focusing on large flows lowers the amount of their evictions two times. Moreover, no eviction occurs for most of the large flows (over 90%). The evolved replacement policy offers better resilience against flooding the flow cache with large amount of short flows which are typical side effects of scanning or distributed denial of service activities. An extension of the replacement policy is also proposed. The extension complements the replacement policy with an additional information extracted from packet headers. The results show further decrease in the number of evictions when the extension is used.
|
|
|
Memory Management in Linux
Tuček, Jaroslav ; Kočí, Radek (referee) ; Vojnar, Tomáš (advisor)
This work describes the memory manager subsystem of the linux kernel. The first part gives a brief account of operating systems architecture and memory management theory - of virtual memory management, page tables, page replacement algorithms and kernel allocators in particular. The second part discusses the actual implementation of these principles in a modern kernel - in linux. Finally, a series of tests stressing the memory subsystem is conducted to determine the memory manager's real behaviour. Limitations of the current linux kernel memory management and some of their proposed solutions are also discussed.
|
|
|
Optimization of network flow monitoring
Žádník, Martin ; Lhotka,, Ladislav (referee) ; Matoušek, Radomil (referee) ; Sekanina, Lukáš (advisor)
The thesis deals with optimization of network flow monitoring. Flow-based network traffic processing, that is, processing packets based on some state information associated to the flows which the packets belong to, is a key enabler for a variety of network services and applications. The number of simultaneous flows increases with the growing number of new services and applications. It has become a challenge to keep a state per each flow in a network device processing high speed traffic. A flow table, a structure with flow states, must be stored in a memory hierarchy. The memory closest to the processing is known as a flow cache. Flow cache management plays an important role in terms of its effective utilization, which affects the performance of the whole system. This thesis focuses on an automated design of cache replacement policy optimized to a deployment on particular networks. A genetic algorithm is proposed to automate this process. The genetic algorithm generates and evaluates evolved replacement policies by a simulation on obtained traffic traces. The proposed algorithm is evaluated by designing replacement policies for two variations of the cache management problem. The first variation is an evolution of the replacement policy with an overall low number of state evictions from the flow cache. The second variation represents an evolution of the replacement policy with a low number of evictions belonging to large flows only. Optimized replacement policies for both variations are found while experimenting with various encoding of the replacement policy and genetic operators. The newly evolved replacement policies achieve better results than other tested policies. The evolved replacement policy lowers the overall amount of evictions by ten percent in comparison with the best compared policy. The evolved replacement policy focusing on large flows lowers the amount of their evictions two times. Moreover, no eviction occurs for most of the large flows (over 90%). The evolved replacement policy offers better resilience against flooding the flow cache with large amount of short flows which are typical side effects of scanning or distributed denial of service activities. An extension of the replacement policy is also proposed. The extension complements the replacement policy with an additional information extracted from packet headers. The results show further decrease in the number of evictions when the extension is used.
|
|
|
Memory Management in Linux
Tuček, Jaroslav ; Kočí, Radek (referee) ; Vojnar, Tomáš (advisor)
This work describes the memory manager subsystem of the linux kernel. The first part gives a brief account of operating systems architecture and memory management theory - of virtual memory management, page tables, page replacement algorithms and kernel allocators in particular. The second part discusses the actual implementation of these principles in a modern kernel - in linux. Finally, a series of tests stressing the memory subsystem is conducted to determine the memory manager's real behaviour. Limitations of the current linux kernel memory management and some of their proposed solutions are also discussed.
|
|
|
The Design of Minimal Bluetooth Stack
Gazda, Martin ; Zbořil, František (referee) ; Hanáček, Petr (advisor)
This master's thesis main aim is to design minimal Bluetooth stack for embedded applications running on an education platform FITkit. This paper contains a theoretical foundation for that work and implementation description. The main section includes Bluetooth protocol stack design and main opportunities which such a design raises.
|
|
|
Stateful Processing of Network Flows
Košek, Martin ; Martínek, Tomáš (referee) ; Kořenek, Jan (advisor)
Modern network traffic processing became a challenging task as there are increasing demands on network security devices. Packet-level processing is not sufficient for advanced network traffic analysis and it is necessary to design processing over entire network flows. Stateful processing in software does not offer enough performance for high-speed networks over 10 Gbps and therefore acceleration in hardware should be utilized. Currently there exists no universal platform for stateful processing in hardware and this task has to be implemented individually. Utilization of such platform significantly speed-up development of stateful network applications. This master thesis analyzes all aspects of stateful network processing platform design. Component based architecture increases platform flexibility and ability to optimize for chosen network applications.
|
|
|
Rendering "Small" Plants in 3D Space
Řehánek, Jiří ; Přibyl, Jaroslav (referee) ; Herout, Adam (advisor)
This masters thesis deals with a real-time low vegetation rendering in 3D space. The low vegetation means grass and shrub. At first it looks on a implementation of vegetation in a 3D games that already exist and there investigate characteristics notable while playing and after that it comes to a evaluation of visual qualities. As next will follow design of solution of this problems and description of implementation. In final part will be summary of achieved product.
|
|
|
Správa politik MoM pro efektivní auto ballooning
Pavlásek, Martin
This diploma thesis offers an overview of hypervisors and methods how they manage memory. Next part describes Memory overcommit Manager, design policies for more efficiet utilization of memory with memory ballooning. There are also description and implementation of newly created MoM Simulator. Purpose of this tool is to easily verificate the policies without running on a real hypervisor. In the latest part there are a description and a design of another new tool for managing constants. It allows applying policies on each virtual machine intedependently.
|
guest ::
